// NC119	最小的K个数
#include <algorithm>
#include <vector>
using namespace std;

class Solution {
 public:
  vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
    std::sort(input.begin(), input.end());
    vector<int> res;
    for (int i = 0; i < k && i < input.size(); i++) {
      res.push_back(input[i]);
    }
    return res;
  }
};
